DC-free coset codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sphere-bound-achieving coset codes and multilevel coset codes

A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that...

متن کامل

DC-Free Codes of Rate , Odd

We report on a new class of dc-free codes of rate ( 1) , is odd. Spectral and runlength properties of the new codes have been evaluated by computer simulation.

متن کامل

DC-free codes of rate (n-1)/n, n odd

{ We report on a new class of dc-free c odes of rate (n;1)=n, n is odd. Spectral and runlength properties of the new codes have been evaluated by computer simulation.

متن کامل

Construction of DC-free Codes Using the Fast Hadamard Transform

We report on new class of dc-free codes that use the Fast Hadamard Transform (FHT) to evaluate a selection set of candidate codewords. The codeword with the least contribution to the low-frequency content is transmitted. The FHT makes it possible to e ciently evaluate the selection set of candidate codewords. Spectral properties of the new codes have been evaluated by computer simulation.

متن کامل

Extremely E cient Dc-free RLL codes for Optical Recording

We will report on new dc-free runlength-limited codes (DCRLL) intended for the next generation of DVD. The e ciency of the newly developed DCRLL schemes is extremely close to the theoretical maximum, and as a result, signi cant density gains can be obtained with respect to prior art coding schemes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1988

ISSN: 0018-9448

DOI: 10.1109/18.9775